منابع مشابه
Variable Bit Quantisation for LSH
We introduce a scheme for optimally allocating a variable number of bits per LSH hyperplane. Previous approaches assign a constant number of bits per hyperplane. This neglects the fact that a subset of hyperplanes may be more informative than others. Our method, dubbed Variable Bit Quantisation (VBQ), provides a datadriven non-uniform bit allocation across hyperplanes. Despite only using a frac...
متن کاملLSH on the Hypercube Revisited
LSH (locality sensitive hashing) had emerged as a powerful technique in nearest-neighbor search in high dimensions [IM98, HIM12]. Given a point set P in a metric space, and given parameters r and ε > 0, the task is to preprocess the point set, such that given a query point q, one can quickly decide if q is in distance at most ≤ r or ≥ (1+ε)r from the query point. Once such a near-neighbor data-...
متن کاملGeneric LSH Families for the Angular Distance Based on Johnson-Lindenstrauss Projections and Feature Hashing LSH
In this paper we propose the creation of generic LSH families for the angular distance based on Johnson-Lindenstrauss projections. We show that feature hashing is a valid J-L projection and propose two new LSH families based on feature hashing. These new LSH families are tested on both synthetic and real datasets with very good results and a considerable performance improvement over other LSH f...
متن کاملData / Signal Bus Processing Module ( PM ) Top − Level Interconnection Network Processing Module ( PM ) Processing Module ( PM ) Processing Module ( PM
This paper describes a compiler that generates both hardware and controlling software for eld-programmable compute accelerators. By analyzing a source program together with part of its input, the compiler generates VHDL descriptions of functional units that are mapped on a set of FPGA chips and an optimized sequence of control instructions that run on the customized machine. The primary techniq...
متن کاملGraph-Parallel Entity Resolution using LSH & IMM
In this paper we describe graph-based parallel algorithms for entity resolution that improve over the map-reduce approach. We compare two approaches to parallelize a Locality Sensitive Hashing (LSH) accelerated, Iterative Match-Merge (IMM) entity resolution technique: BCP, where records hashed together are compared at a single node/reducer, vs an alternative mechanism (RCP) where comparison loa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the VLDB Endowment
سال: 2020
ISSN: 2150-8097
DOI: 10.14778/3377369.3377374